Efficient Off-line Specialization

ing the programming with respect to list length norm :filter match(list,dynamic). :filter match1(list,dynamic,list,dynamic). bin_solve_atom__0(match(B,_),unfold(match1(B,_,B,_))). bin_solve_atom__1(match1(1+C,_,F,_),unfold(match1(F,_,F,_))). bin_solve_atom__1(match1(1+C,_,E,_),unfold(match1(C,_,E,_))). For each binary clause of the form: bin solve atom(p(--),unfold(p(--)): bin_solve_atom__1(match1(1+C,_,F,_),unfold(match1(F,_,F,_))). Argument 1 does not show decrease 1+C→ F Argument 3 does not show decrease F→ F Offending call must be marked as memo. :filter match(list, dynamic). match(Pat,T) :unfold(match1(Pat,T,Pat,T)). match1([],Ts,P,T). match1([A|Ps],[B|Ts],P,[X|T]) :call(A\==B), memo(match1(P,T,P,T)). match1([A|Ps],[A|Ts],P,T) :unfold(match1(Ps,Ts,P,T)). bin_solve_atom__0(match(B,C),unfold(match1(B,C,B,C))). bin_solve_atom__1(match1([B|C],[B|D],E,F),unfold(match1(C,D,E,F))). Abstract program again . . .program again . . . bin_solve_atom__0(match(B,C),unfold(match1(B,C,B,C))). bin_solve_atom__1(match1(1 +C,_,E,_),unfold(match1(C,_,E,_))). For each binary clause of the form: bin solve atom(p(--),unfold(p(--)): bin_solve_atom__1(match1(1 +C,_,E,_),unfold(match1(C,_,E,_))). Argument 1 does show decrease 1+C→ C, and is rigid with respect to the size measure. Hence, local termination is ensured.